The Hamilton–Waterloo Problem with even cycle lengths
نویسندگان
چکیده
منابع مشابه
Minimum degree and even cycle lengths
A classic result of Dirac states that if G is a 2-connected graph of order n with minimum degree δ ≥ 3, then G contains a cycle of length at least min{n, 2δ}. In this paper, we consider the problem of determining the number of different odd or even cycle lengths that must exist under the minimum degree condition. We conjecture that there are δ − 1 even cycles of different lengths, and when G is...
متن کامل5 - The Even Cycle Problem
For k ≥ 2 and l ≥ 0, let C (k, l) denote the family of all cycles of length l modulo k, and C (k) := C (l, 0). In proving the Even Cycle Theorem, we determine almost tight bounds on ex(n,C (k, l)) as well as a method for giving upper bounds on ex(n,C ) for various other infinite families of cycles. Bollobás [2] was the first to show that ex(n,C (k, l)) is linear in n for each pair (k, l) such t...
متن کاملOn the Directed Oberwolfach Problem with Equal Cycle Lengths
We examine the necessary and sufficient conditions for a complete symmetric digraph K n to admit a resolvable decomposition into directed cycles of length m. We give a complete solution for even m, and a partial solution for odd m.
متن کاملThe Even Cycle Problem for Directed Graphs
If each arc in a strongly connected directed graph of minimum in-degree and outdegree at least 3 is assigned a weight 0 or 1, then the resultingweighted directed graph has a directed cycle of even total weight. This provesa conjecture made by L. Lovasz in 1975 and has applications to colour-criticalhypergraphs, sign-nonsingular matrices, and permanents of matrices. MATHEMATICAL ...
متن کاملCycles of even lengths modulo k
Thomassen [9] conjectured that for all natural numbers k > 0 and m, every graph of minimum degree k + 1 contains a cycle of length congruent to 2m modulo k. We prove that this is true for k ≥ 2 if the minimum degree is 2k − 1, which improves the previously known bound of 3k − 2. We also show that Thomassen’s conjecture is true for m = 2.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2019
ISSN: 0012-365X
DOI: 10.1016/j.disc.2019.04.013